Erratum: "Exploring Compositional Architectures and Word Vector Representations for Prepositional Phrase Attachment"
نویسندگان
چکیده
Correction for the list of authors in the refer-ence (Seddah et al., 2013).Correction for the list of authors in the refer-ence (Seddah et al., 2013). ReferencesDjamé Seddah, Reut Tsarfaty, Sandra Kübler, Marie Can-dito, Jinho D. Choi, Richárd Farkas, Jennifer Fos-ter, Iakes Goenaga, Koldo Gojenola Galletebeitia,Yoav Goldberg, Spence Green, Nizar Habash, MarcoKuhlmann, Wolfgang Maier, Joakim Nivre, AdamPrzepiórkowski, Ryan Roth, Wolfgang Seeker, Yan-nick Versley, Veronika Vincze, Marcin Woliński, AlinaWróblewska, and Eric Villemonte de la Clergerie.2013. Overview of the SPMRL 2013 Shared Task: ACross-Framework Evaluation of Parsing Morphologi-cally Rich Languages. In Proceedings of SPMRL. 101Transactions of the Association for Computational Linguistics, vol. 3, pp. 101–101, 2015.Published 2/2015. c©2015 Association for Computational Linguistics.
منابع مشابه
Exploring Compositional Architectures and Word Vector Representations for Prepositional Phrase Attachment
Prepositional phrase (PP) attachment disambiguation is a known challenge in syntactic parsing. The lexical sparsity associated with PP attachments motivates research in word representations that can capture pertinent syntactic and semantic features of the word. One promising solution is to use word vectors induced from large amounts of raw text. However, state-of-the-art systems that employ suc...
متن کاملNeural Network Architectures for Prepositional Phrase Attachment Disambiguation
This thesis addresses the problem of Prepositional Phrase (PP) attachment disambiguation, a key challenge in syntactic parsing. In natural language sentences, a PP may often be attached to several possible candidates. While humans can usually identify the correct candidate successfully, syntactic parsers are known to have high error rated on this kind of construction. This work explores the use...
متن کاملPrepositional Phrase Attachment over Word Embedding Products
We present a low-rank multi-linear model for the task of solving prepositional phrase attachment ambiguity (PP task). Our model exploits tensor products of word embeddings, capturing all possible conjunctions of latent embeddings. Our results on a wide range of datasets and task settings show that tensor products are the best compositional operation and that a relatively simple multi-linear mod...
متن کاملIntegration of Semantic and Syntactic Constraints for Structural Noun Phrase Disambiguation
A fundamental problem in Natural Language Processing is the integration of syntactic and semantic constraints. In this paper we describe a new approach for the integration of syntactic and semantic constraints which takes advantage of a learned memory model. Our model combines localist representations for the integration of constraints and distributed representations for learning semantic const...
متن کاملA Comparison of Vector-based Representations for Semantic Composition
ERRATUM: It has come to our attention that there was a flaw in our use of Socher et al. (2011)’s recursive auto-encoder (RAE). Whereas the original version of this paper used one and the same pair of compositional matrices W (1),W (2) for composing word vectors from all involved sources, in this corrected version we retrained the RAE’s compositional matrices for each word vector source. This so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- TACL
دوره 3 شماره
صفحات -
تاریخ انتشار 2015